Rigid Chains Admitting Many Embeddings
نویسندگان
چکیده
1. Abstract A chain (linearly ordered set) is rigid if it has no non-trivial automor-phisms. The construction of dense rigid chains was carried out by Dushnik and Miller for subsets of R, and there is a rather diierent construction of dense rigid chains of cardinality , an uncountable regular cardinal, using stationary sets as`codes', which was adapted by Droste in 1] to show the existence of rigid measurable spaces. Here we examine the possibility that nevertheless there could be many order-embeddings of the chain, in the sense that the whole chain can be embedded into any interval. In the case of subsets of R, an argument involving Baire category is used to modify the original one. For uncountable regular cardinals, a more complicated version of the corresponding argument is used, in which the stationary sets are replaced by sequences of stationary sets, and the chain is built up using a tree. The construction is also adapted to the case of singular cardinals.
منابع مشابه
Low-distortion embeddings of graphs with large girth
The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into `1 with uniformly bounded distortions. This result solves the problem posed by N. Linial, A. Magen, and A. Naor (2002). 2010 Mathematics Subject Classification: Primary: 46B85; Secondary: 05C12, 54E35
متن کاملCounting Euclidean embeddings of rigid graphs
A graph is called (generically) rigid in Rd if, for any choice of sufficiently generic edge lengths, it can be embedded in Rd in a finite number of distinct ways, modulo rigid transformations. Here we deal with the problem of determining the maximum number of planar Euclidean embeddings as a function of the number of the vertices. We obtain polynomial systems which totally capture the structure...
متن کاملFrom planar graph layout to flat embeddings of 2-complexes
A question about 2-complexes, analogous to graph planarity, is whether they can be embedded in 3 dimensions. This is a difficult question. Also, whereas planar graphs always admit straightedge embeddings, it is known that 2-complexes may admit embeddings without admitting flatface embeddings. We consider three methods for straight-edge planar graph layout: barycentric maps (and convex-combinati...
متن کاملQuadrangular embeddings of complete graphs∗
Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...
متن کامل0 M ay 2 00 7 Nonorientable 3 - manifolds admitting coloured triangulations with at most 30 tetrahedra ∗
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer procedures, all rigid nonbipartite crystallizations up to 30 vertices. 2000 Mathematics Subject Classification: 57Q15, 57M15, 57N10.
متن کامل